NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
221	Just Act Mostly Natural 1 by Ucaoimhu Now that Wordplay has been so well received, the filmmakers are already working on the sequel, Wordplay Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2009-04-19 00:17:56 NP-complete problems Logic puzzles Puzzle video games Sudoku Word play Shazam
222	Approximating Connected Facility Location Problems via Random Facility Sampling and Core Detouring Thomas Rothvoß Institute of Mathematics ´ Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 NP-complete problems Operations research Approximation algorithms Steiner tree problem Facility location problem APX Approximation
223	tria-free-after-review14.dvi Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-04-30 01:42:59 NP-complete problems Graph operations Graph coloring Graph theory Line graph Clique Chordal graph Neighbourhood Planar graph Vertex Triangle-free graph Dominating set
224	The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-07-11 20:53:15 NP-complete problems Graph coloring Bipartite graph Parity Comparability graph Matching Trapezoid graph Interval graph Graph Independent set Interval edge coloring Planar graph
225	MAX CUT in cubic graphs Eran Halperin ∗ Dror Livnat Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2009-01-01 08:42:50 Graph theory Combinatorial optimization NP-complete problems Matching Maximum cut Clique Graph Cubic graph Degree Cut Directed graph Line graph
226	DISCRETE APPLIED MATHEMATICS ELSEYIER Discrete Applied Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2010-06-13 16:41:26 Graph theory Mathematics NP-complete problems NP-hard problems Graph coloring Routing algorithms Search algorithms Hamiltonian path Bipartite graph Travelling salesman problem A* search algorithm Planar separator theorem
227	Geometric Ad-Hoc Routing: Of Theory and Practice∗ Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Zollinger Department of Computer Science ETH Zurich 8092 Zurich, Switzerland {kuhn, wattenhofer, yzhang, zollinger}@inf Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:22 Graph theory Mathematics Routing algorithms Edsger W. Dijkstra NP-complete problems Network theory Geographic routing Shortest path problem Geometric spanner Routing Planar graph Unit disk graph
228	Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs∗ Iyad Kanj1 , Christian Komusiewicz2 , Manuel Sorge3 , and Erik Jan van Leeuwen4 1 2 Add to Reading List Source URL: users.minet.uni-jena.de Language: English Graph theory Cluster graph Matching Clique Ear decomposition Neighbourhood NP-complete problems Line graph Graph coloring
229	JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek Add to Reading List Source URL: jmlr.org Language: English - Date: 2015-07-20 20:08:36 Graph theory Computational complexity theory Mathematics NP-complete problems Dense subgraph Independent set Planted clique Clique Dense graph Hypergraph Graph coloring Subgraph isomorphism problem
230	COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS ´n Alexander Barvinok and Pablo Sobero May 2015 Add to Reading List Source URL: www.math.lsa.umich.edu Language: English - Date: 2015-05-01 16:21:13 Graph theory Mathematics NP-complete problems Graph coloring Line graph Graph homomorphism Approximately finite-dimensional C*-algebra Orbifold

UPDATE